package 算法.练习1;

import 算法.NiuKe.ListNode;

/**
 * @author:谢君臣
 * @Date:2021/8/25-10:32
 * @version:1.0
 * @function:
 */
public class nc50 {
    public ListNode reverseKGroup (ListNode head, int k) {
        // write code here
        ListNode p = head;
        ListNode q = head;
        int i = 0;
        while (p.next!=null){

        }

        return null;
    }
}
class Person{



}